Geometric Algorithms on CUDA
نویسندگان
چکیده
The recent launch of the NVIDIA CUDA technology has opened a new era in the young field of GPGPU (General Purpose computation on GPUS). This technology allows the design and implementation of parallel algorithms in a much simpler way than previous approaches based on shader programming. The present work explores the possibilities of CUDA for solving basic geometric problems on 3D triangle meshes like the point inclusion test or the self-intersection detection. A solution to these problems can be implemented in CUDA with only a small fraction of the effort required to design and implement an equivalent solution using shader programming, and the results are impressive when compared to a CPU execution.
منابع مشابه
Gaalop - High Performance Parallel Computing Based on Conformal Geometric Algebra
We present Gaalop (Geometric algebra algorithms optimizer), our tool for high performance computing based on conformal geometric algebra. The main goal of Gaalop is to realize implementations that are most likely faster than conventional solutions. In order to achieve this goal, our focus is on parallel target platforms like FPGA (field-programmable gate arrays) or the CUDA technology from NVID...
متن کاملGaalop Compiler Driver
The focus of the this work is on the better integration of algorithms expressed in Conformal Geometric Algebra (CGA) in modern high level computer languages, namely C++ and NVIDIA’s Compute Unified Device Architecture (CUDA). A high runtime performance in terms of CGA is achieved using symbolic optimizing through the invocation of Gaalop.
متن کاملGeometric Algebra enhanced Precompiler for C++ and OpenCL
The focus of the this work is a simplified integration of algorithms expressed in Geometric Algebra (GA) in modern high level computer languages, namely C++, OpenCL and CUDA. A high runtime performance in terms of GA is achieved using symbolic simplification and code generation by a Precompiler that is directly integrated into CMake-based build toolchains.
متن کاملOptimizations and Performance of a Robotics Grasping Algorithm Described in Geometric Algebra
The usage of Conformal Geometric Algebra leads to algorithms that can be formulated in a very clear and easy to grasp way. But it can also increase the performance of an implementation because of its capabilities to be computed in parallel. In this paper we show how a grasping algorithm for a robotic arm is accelerated using a Conformal Geometric Algebra formulation. The optimized C code is pro...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کامل